A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time
نویسندگان
چکیده
Abstract Distributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient (DEHFSP) fuzzy processing time considered a cooperated shuffled frog-leaping algorithm (CSFLA) presented to optimize makespan, total agreement index energy consumption simultaneously. Iterated greedy, variable neighborhood search global are designed using problem-related features; memeplex evaluation based on three quality indices presented, an effective cooperation process between the best worst developed according results performed by exchanging times ability, adaptive population shuffling adopted improve efficiency. Extensive experiments conducted computational validate that CSFLA promising advantages solving DEHFSP.
منابع مشابه
An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem
This paper presents an effective shuffled frogleaping algorithm (SFLA) for solving a lot-streaming flow shop scheduling problem with equal-size sublots, where a criterion is to minimize maximum completion time (i.e., makespan) under both an idling and no-idling production cases. Unlike the original SFLA, the proposed SFLA represents an individual or frog as a job permutation and utilizes a posi...
متن کاملSolving Energy-Aware Real-Time Tasks Scheduling Problem with Shuffled Frog Leaping Algorithm on Heterogeneous Platforms
Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remissi...
متن کاملAn Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the propos...
متن کاملShuffled frog leaping algorithm approach to employee timetabling and job shop scheduling
In manufacturing systems, generally employee timetabling and job shop scheduling is considered to be too hard and complex. To achieve an integrated manufacturing environment, the integration of employee timetabling and job shop scheduling is essential. It is a process of assigning employees into work slots in a pattern according to the hierarchy level of the employee, job allotment, individual ...
متن کاملA Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2021
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-021-00400-2